Impact of Stopping Set Properties on Iterative Decoding of FG-LDPC Codes on the Binary Symmetric Channel
نویسندگان
چکیده
Stopping set properties determine the iterative decoding performance of any linear block code on the Binary Erasure Channel (BEC). Furthermore, there is a common conception that they are crucial factors on other channels, like the Binary Symmetric Channel (BSC), as well. In order to investigate whether this is true indeed, we study stopping set properties and iterative decoding performance on the BSC of Finite-Geometry Low-Density Parity-Check (FG-LDPC) codes, which have been chosen due to their effectiveness and the good structure of their parity-check matrices (PCMs). Also modified versions of these PCMs are considered. As a rather surprising result, we show that a PCM with better stopping set properties than another PCM of the same code does not necessarily lead a better decoding performance on the BSC. Also, PCMs of the same code with the same stopping set properties, do not always have the same decoding performance on the BSC.
منابع مشابه
On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing
This paper considers the performance of (j, k)regular low-density parity-check (LDPC) codes with messagepassing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binary erasure channel (BEC) and the qary symmetric channel (q-SC). For the BEC, the density evolution (DE) threshold of iterative decoding scales ...
متن کاملOn the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing the single parity-check constituent codes in Gallager’s LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDP...
متن کاملProperties of Ldgm-ldpc Codes with Applications to Secrecy Coding
OF THE THESIS Properties of LDGM-LDPC codes With Applications to Secrecy Coding by Manik Raina Thesis Directors: Professor Predrag Spasojević The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly punctured outputbits. It is sh...
متن کاملStudy of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis
In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated ...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders: Stability Conditions on Zm Codes and Cutoff Rate Analysis on Non-symmetric Binary Channels
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...
متن کامل